Perturbed Ishikawa-hybrid quasi-proximal point algorithm with accretive mappings for a fuzzy system
نویسندگان
چکیده
منابع مشابه
A Hybrid Proximal Point Three-Step Algorithm for Nonlinear Set-Valued Quasi-Variational Inclusions System Involving (A,)-Accretive Mappings
The main purpose of this paper is to introduce and study a new class of generalized nonlinear setvalued quasi-variational inclusions system involving A, η -accretive mappings in Banach spaces. By using the resolvent operator due to Lan-Cho-Verma associated with A, η -accretive mappings and the matrix analysis method, we prove the convergence of a new hybrid proximal point three-step iterative a...
متن کاملAn Ishikawa-Hybrid Proximal Point Algorithm for Nonlinear Set-Valued Inclusions Problem Based on (A,)-Accretive Framework
A general nonlinear framework for an Ishikawa-hybrid proximal point algorithm using the notion of A, η -accretive is developed. Convergence analysis for the algorithm of solving a nonlinear set-valued inclusions problem and existence analysis of solution for the nonlinear set-valued inclusions problem are explored along with some results on the resolvent operator corresponding to A, η -accretiv...
متن کاملA Hybrid Proximal Point Algorithm for Resolvent operator in Banach Spaces
Equilibrium problems have many uses in optimization theory and convex analysis and which is why different methods are presented for solving equilibrium problems in different spaces, such as Hilbert spaces and Banach spaces. The purpose of this paper is to provide a method for obtaining a solution to the equilibrium problem in Banach spaces. In fact, we consider a hybrid proximal point algorithm...
متن کاملGraph Convergence for H(.,.)-co-Accretive Mapping with over-Relaxed Proximal Point Method for Solving a Generalized Variational Inclusion Problem
In this paper, we use the concept of graph convergence of H(.,.)-co-accretive mapping introduced by [R. Ahmad, M. Akram, M. Dilshad, Graph convergence for the H(.,.)-co-accretive mapping with an application, Bull. Malays. Math. Sci. Soc., doi: 10.1007/s40840-014-0103-z, 2014$] and define an over-relaxed proximal point method to obtain the solution of a generalized variational inclusion problem ...
متن کاملA Hybrid Projection – Proximal Point Algorithm ∗
We propose a modification of the classical proximal point algorithm for finding zeroes of a maximal monotone operator in a Hilbert space. In particular, an approximate proximal point iteration is used to construct a hyperplane which strictly separates the current iterate from the solution set of the problem. This step is then followed by a projection of the current iterate onto the separating h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fixed Point Theory and Applications
سال: 2013
ISSN: 1687-1812
DOI: 10.1186/1687-1812-2013-281